Minimax fractional programming involving generalised invex functions
نویسندگان
چکیده
منابع مشابه
Minimax Fractional Programming Involving Type I and Related Functions
⎯The convexity assumptions for a minimax fractional programming problem of variational type are relaxed to those of a type I and related functions. Sufficient optimality conditions are established under the aforesaid assumptions. Several duality theorems are obtained for Wolfe type and Mond-Weir type duals and the original problem. Keyword⎯Minimax programming; Fractional programming; Sufficient...
متن کاملOptimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions
Abstract. In this paper a generalization of invexity is considered in a general form, by means of the concept of K-directional derivative. Then in the case of nonlinear multiobjective programming problems where the functions involved are nondifferentiable, we established sufficient optimality conditions without any convexity assumption of the K-directional derivative. Then we obtained some dual...
متن کاملSecond-Order Duality for Nondifferentiable Minimax Fractional Programming Involving (F, ρ)-Convexity
We focus our study to formulate two different types of second-order dual models for a nondifferentiable minimax fractional programming problem and derive duality theorems under (F, ρ)-convexity. Several results including many recent works are obtained as special cases.
متن کاملHigher-Order Duality for Minimax Fractional Type Programming Involving Symmetric Matrices
Convexity and generalized convexity play important roles in optimization theory. With the development of programming problem, there has been a growing interest in the higher-order dual problem and a lot of related generalized convexities are given. In this paper, we give the convexity of ( , , , , , ) F d b vector-pseudoquasi-Type I and formulate a higher-order duality for minimax fract...
متن کاملDuality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F,α,ρ,d)-Convexity
In this paper, we discuss nondifferentiable minimax fractional programming problem where the involved functions are locally Lipschitz. Furthermore, weak, strong and strict converse duality theorems are proved in the setting of Mond-Weir type dual under the assumption of generalized (F,α,ρ,d)-convexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The ANZIAM Journal
سال: 2003
ISSN: 1446-1811,1446-8735
DOI: 10.1017/s1446181100008063